A Fixed-Length Coding Algorithm for DNA Sequence Compression
نویسندگان
چکیده
Summary: While achieving a compression ratio of 2.0 bits/base ,the new algorithm codes non-N bases1 in fixed length.It dramatically reduces the time of coding and decoding than previous DNA compression algorithms and some universal compression programs. Availability: http://grandlab.cer.net/topic.php?TopicID=50 Contact: [email protected] [email protected] [email protected]
منابع مشابه
تخمین مکان نواحی کدکننده پروتئین در توالی عددی DNA با استفاده پنجره با طول متغیر بر مبنای منحنی سه بعدی Z
In recent years, estimation of protein-coding regions in numerical deoxyribonucleic acid (DNA) sequences using signal processing tools has been a challenging issue in bioinformatics, owing to their 3-base periodicity. Several digital signal processing (DSP) tools have been applied in order to Identify the task and concentrated on assigning numerical values to the symbolic DNA sequence, then app...
متن کاملTurbo Source Coding: A Noise-Robust Approach to Data Compression
All traditional data compression techniques, such as Huffman coding, the Lempel-Ziv algorithm, run-length limited coding, Tunstall coding and arithmetic coding are highly susceptible to residual channel errors and noise. We have recently proposed the use of parallel concatenated codes and iterative decoding for fixed-length to fixed-length source coding, i.e., turbo coding for data compression ...
متن کاملLZAC Lossless Data Compression
This paper presents LZAC, a new universal lossless data compression algorithm derived from the popular and widely used LZ77 family. The objective of LZAC is to improve the compression ratios of the LZ77 family while still retaining the family’s key characteristics: simple, universal, fast in decoding, and economical in memory consumption. LZAC presents two new ideas: composite fixed-variable-le...
متن کاملA Fixed-Rate Quantizer Using Block-Based Entropy-Constrained Quantization and Run-Length Coding
II Nine possible options for (y 1 ; y 2) together with coded bits and their lengths. : 8 III The Huuman table for Example 4 abstract In this paper, we develop a fast and eecient quantization technique which is xed-length, robust to bit errors, and compatible with most current compression standards. It is based on entropy-constrained quantization and uses an eecient delayed decision algorithm to...
متن کاملUniversal Source Codes Lecturer : Himanshu Tyagi Scribe : Sandip Sinha
• Huffman Code (optimal prefix-free code) • Shannon-Fano code • Shannon-Fano-Elias code • Arithmetic code (can handle a sequence of symbols) In general, the first three codes do not achieve the optimal rate H(X), and there are no immediate extensions of these codes to rate-optimal codes for a sequence of symbols. On the other hand, arithmetic coding is rate-optimal. However, all these schemes a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/cs/0506040 شماره
صفحات -
تاریخ انتشار 2005